Theshold Dynamics for Statistical Density Estimation and Graph Clustering
نویسنده
چکیده
of the Dissertation Theshold Dynamics for Statistical Density Estimation and Graph Clustering
منابع مشابه
The Conditional-Potts Clustering Model
A Bayesian kernel-based clustering method is presented. The associated model arises as an embedding of the Potts density for label membership probabilities into an extended Bayesian model for joint data and label membership probabilities. The method may be seen as a principled extension of the so-called super-paramagnetic clustering. The model depends on three parameters: the temperature, the k...
متن کاملSpectral clustering, kernel density estimation and its application on ischemia detection
We considered new ways of clustering, classification and segmentation using spectral graph theory. We devised a novel method of estimating the number of clusters. From this, we could contrive a graph partitioning procedure which used physical intuitions of mass-spring network. And we used the technique of estimating the number of clusters to approximate probability density. This allowed us to s...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملSpectral Estimation of Conditional Random Graph Models for Large-Scale Network Data
Generative models for graphs have been typically committed to strong prior assumptions concerning the form of the modeled distributions. Moreover, the vast majority of currently available models are either only suitable for characterizing some particular network properties (such as degree distribution or clustering coefficient), or they are aimed at estimating joint probability distributions, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013